Polyharmonicity and algebraic support of measures

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polyharmonicity and algebraic support of measures

Our main result states that two signed measures μ and ν with bounded support contained in the zero set of a polynomial P (x) are equal if they coincide on the subspace of all polynomials of polyharmonic degree NP where the natural number NP is explicitly computed by the properties of the polynomial P (x). The method of proof depends on a definition of a multivariate Markov transform which is an...

متن کامل

Algebraic Measures of Entanglement

We study the rank of a general tensor u in a tensor product space H1 ⊗ · · · ⊗ Hk. The rank of u is the minimal number p of pure states v1, · · · , vp such that u is a linear combination of the vj ’s. This rank is an algebraic measure of the degree of entanglement of u. Motivated by quantum computation, we completely describe the rank of an arbitrary tensor in (C) and give normal forms for tens...

متن کامل

Algebraic distance in algebraic cone metric spaces and its properties

In this paper, we prove some properties of algebraic cone metric spaces and introduce the notion of algebraic distance in an algebraic cone metric space. As an application, we obtain some famous fixed point results in the framework of this algebraic distance.

متن کامل

Ideal Constructions and Irrationality Measures of Roots of Algebraic Numbers

This paper addresses the problem of determining the best results one can expect using the Thue-Siegel method as developed by Bombieri in his equivariant approach to effective irrationality measures to roots of high order of algebraic numbers, in the non-archimedean setting. As an application, we show that this method, under a nonvanishing assumption for the auxiliary polynomial which replaces t...

متن کامل

Algebraic multigrid support vector machines

The support vector machine is a flexible optimization-based technique widely used for classification problems. In practice, its training part becomes computationally expensive on large-scale data sets because of such reasons as the complexity and number of iterations in parameter fitting methods, underlying optimization solvers, and nonlinearity of kernels. We introduce a fast multilevel framew...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Hiroshima Mathematical Journal

سال: 2007

ISSN: 0018-2079

DOI: 10.32917/hmj/1176324093